A blow-up lemma for approximate decompositions
نویسندگان
چکیده
منابع مشابه
An approximate blow-up lemma for sparse pseudorandom graphs
We state a sparse approximate version of the blow-up lemma, showing that regular partitions in sufficiently pseudorandom graphs behave almost like complete partite graphs for embedding graphs with maximum degree ∆. We show that (p, γ)-jumbled graphs, with γ = o(pmax(2∆,∆+3/2)n), are “sufficiently pseudorandom”. The approach extends to random graphs Gn,p with p ( log n n )1/∆.
متن کاملA hypergraph blow-up lemma
Weobtain a hypergraph generalisation of the graph blow-up lemma proved byKomlós, Sarközy and Szemerédi, showing that hypergraphs with sufficient regularity and no atypical vertices behave as if they were complete for the purpose of embedding bounded degree hypergraphs. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 39, 275–376, 2011
متن کاملBlow-Up Lemma
The Regularity Lemma [16] is a powerful tool in Graph Theory and its applications. It basically says that every graph can be well approximated by the union of a constant number of random-looking bipartite graphs called regular pairs (see the definitions below). These bipartite graphs share many local properties with random bipartite graphs, e.g. most degrees are about the same, most pairs of ve...
متن کاملA quantitative version of the Blow-up Lemma
In this paper we give a quantitative version of the Blow-up Lemma.
متن کاملAn Extension of the Blow-up Lemma to Arrangeable Graphs
The Blow-up Lemma established by Komlós, Sárközy, and Szemerédi in 1997 is an important tool for the embedding of spanning subgraphs of bounded maximum degree. Here we prove several generalisations of this result concerning the embedding of a-arrangeable graphs, where a graph is called aarrangeable if its vertices can be ordered in such a way that the neighbours to the right of any vertex v hav...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2018
ISSN: 0002-9947,1088-6850
DOI: 10.1090/tran/7411